TSTP Solution File: CSR143^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR143^2 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:34:40 EDT 2024
% Result : Theorem 0.38s 0.59s
% Output : CNFRefutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of formulae : 34 ( 6 unt; 8 typ; 0 def)
% Number of atoms : 87 ( 0 equ; 0 cnn)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 232 ( 41 ~; 30 |; 11 &; 146 @)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 25 ( 25 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 31 ( 0 ^ 29 !; 2 ?; 31 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_48,type,
holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
thf(decl_49,type,
husband_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_61,type,
inverse_THFTYPE_IIiioIIiioIoI: ( $i > $i > $o ) > ( $i > $i > $o ) > $o ).
thf(decl_71,type,
lChris_THFTYPE_i: $i ).
thf(decl_72,type,
lCorina_THFTYPE_i: $i ).
thf(decl_116,type,
lYearFn_THFTYPE_IiiI: $i > $i ).
thf(decl_129,type,
n2009_THFTYPE_i: $i ).
thf(decl_152,type,
wife_THFTYPE_IiioI: $i > $i > $o ).
thf(ax_075,axiom,
! [X60: $i,X31: $o] :
( ( holdsDuring_THFTYPE_IiooI @ X60 @ ~ X31 )
=> ~ ( holdsDuring_THFTYPE_IiooI @ X60 @ X31 ) ),
file('/export/starexec/sandbox/tmp/tmp.AoMS7F1TRh/E---3.1_11163.p',ax_075) ).
thf(con,conjecture,
? [X9: $i] : ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( husband_THFTYPE_IiioI @ X9 @ lCorina_THFTYPE_i ) ),
file('/export/starexec/sandbox/tmp/tmp.AoMS7F1TRh/E---3.1_11163.p',con) ).
thf(ax_093,axiom,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i ),
file('/export/starexec/sandbox/tmp/tmp.AoMS7F1TRh/E---3.1_11163.p',ax_093) ).
thf(ax_047,axiom,
! [X11: $i] : ( holdsDuring_THFTYPE_IiooI @ X11 @ $true ),
file('/export/starexec/sandbox/tmp/tmp.AoMS7F1TRh/E---3.1_11163.p',ax_047) ).
thf(ax_005,axiom,
! [X13: $i > $i > $o,X14: $i > $i > $o] :
( ( inverse_THFTYPE_IIiioIIiioIoI @ X14 @ X13 )
=> ! [X15: $i,X16: $i] :
( ( X14 @ X15 @ X16 )
<=> ( X13 @ X16 @ X15 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.AoMS7F1TRh/E---3.1_11163.p',ax_005) ).
thf(ax_082,axiom,
inverse_THFTYPE_IIiioIIiioIoI @ husband_THFTYPE_IiioI @ wife_THFTYPE_IiioI,
file('/export/starexec/sandbox/tmp/tmp.AoMS7F1TRh/E---3.1_11163.p',ax_082) ).
thf(c_0_6,plain,
! [X60: $i,X31: $o] :
( ( ( X31
| ( holdsDuring_THFTYPE_IiooI @ X60 @ $true ) )
& ( ~ X31
| ( holdsDuring_THFTYPE_IiooI @ X60 @ $false ) ) )
=> ~ ( holdsDuring_THFTYPE_IiooI @ X60 @ X31 ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[ax_075])]) ).
thf(c_0_7,negated_conjecture,
~ ? [X9: $i] :
( ( ~ ( husband_THFTYPE_IiioI @ X9 @ lCorina_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( husband_THFTYPE_IiioI @ X9 @ lCorina_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
thf(c_0_8,axiom,
( ( ~ ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[ax_093]) ).
thf(c_0_9,plain,
! [X221: $i,X222: $o] :
( ( X222
| ~ X222
| ~ ( holdsDuring_THFTYPE_IiooI @ X221 @ X222 ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ X221 @ $false )
| ~ X222
| ~ ( holdsDuring_THFTYPE_IiooI @ X221 @ X222 ) )
& ( X222
| ~ ( holdsDuring_THFTYPE_IiooI @ X221 @ $true )
| ~ ( holdsDuring_THFTYPE_IiooI @ X221 @ X222 ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ X221 @ $false )
| ~ ( holdsDuring_THFTYPE_IiooI @ X221 @ $true )
| ~ ( holdsDuring_THFTYPE_IiooI @ X221 @ X222 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
thf(c_0_10,plain,
! [X220: $i] : ( holdsDuring_THFTYPE_IiooI @ X220 @ $true ),
inference(variable_rename,[status(thm)],[ax_047]) ).
thf(c_0_11,negated_conjecture,
! [X216: $i] :
( ( ~ ( husband_THFTYPE_IiioI @ X216 @ lCorina_THFTYPE_i )
| ( husband_THFTYPE_IiioI @ X216 @ lCorina_THFTYPE_i ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( husband_THFTYPE_IiioI @ X216 @ lCorina_THFTYPE_i ) )
& ( ~ ( husband_THFTYPE_IiioI @ X216 @ lCorina_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
thf(c_0_12,plain,
! [X235: $i > $i > $o,X236: $i > $i > $o,X237: $i,X238: $i] :
( ( ~ ( X236 @ X237 @ X238 )
| ( X235 @ X238 @ X237 )
| ~ ( inverse_THFTYPE_IIiioIIiioIoI @ X236 @ X235 ) )
& ( ~ ( X235 @ X238 @ X237 )
| ( X236 @ X237 @ X238 )
| ~ ( inverse_THFTYPE_IIiioIIiioIoI @ X236 @ X235 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax_005])])])])]) ).
thf(c_0_13,plain,
( ( ~ ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
thf(c_0_14,plain,
! [X1: $i] :
( ~ ( holdsDuring_THFTYPE_IiooI @ X1 @ $true )
| ~ ( holdsDuring_THFTYPE_IiooI @ X1 @ ~ $true ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_9])])]) ).
thf(c_0_15,plain,
! [X1: $i] : ( holdsDuring_THFTYPE_IiooI @ X1 @ $true ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i] :
( ~ ( husband_THFTYPE_IiioI @ X1 @ lCorina_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_17,plain,
! [X1: $i,X2: $i,X13: $i > $i > $o,X5: $i > $i > $o] :
( ( X13 @ X2 @ X1 )
| ~ ( X5 @ X1 @ X2 )
| ~ ( inverse_THFTYPE_IIiioIIiioIoI @ X13 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_18,plain,
inverse_THFTYPE_IIiioIIiioIoI @ husband_THFTYPE_IiioI @ wife_THFTYPE_IiioI,
inference(split_conjunct,[status(thm)],[ax_082]) ).
thf(c_0_19,plain,
( ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_20,plain,
! [X1: $i] :
~ ( holdsDuring_THFTYPE_IiooI @ X1 @ ~ $true ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).
thf(c_0_21,negated_conjecture,
! [X1: $i] :
~ ( husband_THFTYPE_IiioI @ X1 @ lCorina_THFTYPE_i ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_15])]) ).
thf(c_0_22,plain,
! [X2: $i,X1: $i] :
( ( husband_THFTYPE_IiioI @ X1 @ X2 )
| ~ ( wife_THFTYPE_IiioI @ X2 @ X1 ) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_23,plain,
wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i,
inference(sr,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_24,negated_conjecture,
! [X1: $i] :
~ ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ X1 ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
thf(c_0_25,plain,
$false,
inference(sr,[status(thm)],[c_0_23,c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.15 % Problem : CSR143^2 : TPTP v8.1.2. Released v4.1.0.
% 0.16/0.16 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n024.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Fri May 3 15:10:38 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.38/0.53 Running higher-order theorem proving
% 0.38/0.53 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.AoMS7F1TRh/E---3.1_11163.p
% 0.38/0.59 # Version: 3.1.0-ho
% 0.38/0.59 # Preprocessing class: HSLMSMSMSSSNHFA.
% 0.38/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.59 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.38/0.59 # Starting new_ho_10 with 300s (1) cores
% 0.38/0.59 # Starting new_bool_6 with 300s (1) cores
% 0.38/0.59 # Starting lpo8_s with 300s (1) cores
% 0.38/0.59 # lpo8_s with pid 11245 completed with status 0
% 0.38/0.59 # Result found by lpo8_s
% 0.38/0.59 # Preprocessing class: HSLMSMSMSSSNHFA.
% 0.38/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.59 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.38/0.59 # Starting new_ho_10 with 300s (1) cores
% 0.38/0.59 # Starting new_bool_6 with 300s (1) cores
% 0.38/0.59 # Starting lpo8_s with 300s (1) cores
% 0.38/0.59 # SinE strategy is GSinE(CountFormulas,hypos,4.0,,6,20000,1.0)
% 0.38/0.59 # Search class: HGHSS-FSMM21-SHFFFFBN
% 0.38/0.59 # partial match(1): HGHSS-FFMM21-SHFFFFBN
% 0.38/0.59 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.38/0.59 # Starting new_ho_10 with 163s (1) cores
% 0.38/0.59 # new_ho_10 with pid 11249 completed with status 0
% 0.38/0.59 # Result found by new_ho_10
% 0.38/0.59 # Preprocessing class: HSLMSMSMSSSNHFA.
% 0.38/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.59 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.38/0.59 # Starting new_ho_10 with 300s (1) cores
% 0.38/0.59 # Starting new_bool_6 with 300s (1) cores
% 0.38/0.59 # Starting lpo8_s with 300s (1) cores
% 0.38/0.59 # SinE strategy is GSinE(CountFormulas,hypos,4.0,,6,20000,1.0)
% 0.38/0.59 # Search class: HGHSS-FSMM21-SHFFFFBN
% 0.38/0.59 # partial match(1): HGHSS-FFMM21-SHFFFFBN
% 0.38/0.59 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.38/0.59 # Starting new_ho_10 with 163s (1) cores
% 0.38/0.59 # Preprocessing time : 0.004 s
% 0.38/0.59 # Presaturation interreduction done
% 0.38/0.59
% 0.38/0.59 # Proof found!
% 0.38/0.59 # SZS status Theorem
% 0.38/0.59 # SZS output start CNFRefutation
% See solution above
% 0.38/0.59 # Parsed axioms : 430
% 0.38/0.59 # Removed by relevancy pruning/SinE : 151
% 0.38/0.59 # Initial clauses : 302
% 0.38/0.59 # Removed in clause preprocessing : 6
% 0.38/0.59 # Initial clauses in saturation : 296
% 0.38/0.59 # Processed clauses : 624
% 0.38/0.59 # ...of these trivial : 35
% 0.38/0.59 # ...subsumed : 5
% 0.38/0.59 # ...remaining for further processing : 584
% 0.38/0.59 # Other redundant clauses eliminated : 2
% 0.38/0.59 # Clauses deleted for lack of memory : 0
% 0.38/0.59 # Backward-subsumed : 1
% 0.38/0.59 # Backward-rewritten : 2
% 0.38/0.59 # Generated clauses : 89
% 0.38/0.59 # ...of the previous two non-redundant : 86
% 0.38/0.59 # ...aggressively subsumed : 0
% 0.38/0.59 # Contextual simplify-reflections : 0
% 0.38/0.59 # Paramodulations : 85
% 0.38/0.59 # Factorizations : 0
% 0.38/0.59 # NegExts : 0
% 0.38/0.59 # Equation resolutions : 3
% 0.38/0.59 # Disequality decompositions : 0
% 0.38/0.59 # Total rewrite steps : 40
% 0.38/0.59 # ...of those cached : 23
% 0.38/0.59 # Propositional unsat checks : 0
% 0.38/0.59 # Propositional check models : 0
% 0.38/0.59 # Propositional check unsatisfiable : 0
% 0.38/0.59 # Propositional clauses : 0
% 0.38/0.59 # Propositional clauses after purity: 0
% 0.38/0.59 # Propositional unsat core size : 0
% 0.38/0.59 # Propositional preprocessing time : 0.000
% 0.38/0.59 # Propositional encoding time : 0.000
% 0.38/0.59 # Propositional solver time : 0.000
% 0.38/0.59 # Success case prop preproc time : 0.000
% 0.38/0.59 # Success case prop encoding time : 0.000
% 0.38/0.59 # Success case prop solver time : 0.000
% 0.38/0.59 # Current number of processed clauses : 291
% 0.38/0.59 # Positive orientable unit clauses : 249
% 0.38/0.59 # Positive unorientable unit clauses: 0
% 0.38/0.59 # Negative unit clauses : 13
% 0.38/0.59 # Non-unit-clauses : 29
% 0.38/0.59 # Current number of unprocessed clauses: 45
% 0.38/0.59 # ...number of literals in the above : 143
% 0.38/0.59 # Current number of archived formulas : 0
% 0.38/0.59 # Current number of archived clauses : 291
% 0.38/0.59 # Clause-clause subsumption calls (NU) : 764
% 0.38/0.59 # Rec. Clause-clause subsumption calls : 429
% 0.38/0.59 # Non-unit clause-clause subsumptions : 1
% 0.38/0.59 # Unit Clause-clause subsumption calls : 157
% 0.38/0.59 # Rewrite failures with RHS unbound : 0
% 0.38/0.59 # BW rewrite match attempts : 1
% 0.38/0.59 # BW rewrite match successes : 1
% 0.38/0.59 # Condensation attempts : 624
% 0.38/0.59 # Condensation successes : 1
% 0.38/0.59 # Termbank termtop insertions : 15068
% 0.38/0.59 # Search garbage collected termcells : 2207
% 0.38/0.59
% 0.38/0.59 # -------------------------------------------------
% 0.38/0.59 # User time : 0.034 s
% 0.38/0.59 # System time : 0.004 s
% 0.38/0.59 # Total time : 0.038 s
% 0.38/0.59 # Maximum resident set size: 3000 pages
% 0.38/0.59
% 0.38/0.59 # -------------------------------------------------
% 0.38/0.59 # User time : 0.040 s
% 0.38/0.59 # System time : 0.007 s
% 0.38/0.59 # Total time : 0.048 s
% 0.38/0.59 # Maximum resident set size: 2044 pages
% 0.38/0.59 % E---3.1 exiting
% 0.38/0.59 % E exiting
%------------------------------------------------------------------------------